comparing congruency robust method and l1 norm minimization in micro geodesy networks
نویسندگان
چکیده
for calculation of the displacements of points in micro geodesy networks, it is essential to discover stable and unstable points. without knowing stable points, calculated displacements are due to datum deficiency. in this case, calculated displacements are not valid. there are two methods to discover stable and unstable points: a-congruency robust method b- l1 norm minimization in this study the two mentioned methods are compared and the advantages and disadvantages of both are studied. for this reason, the two methods are programmed and several networks tested by them. the results of comparing these two methods appear below: 1- the two methods similarly detect all the points moved eighteen percent. l1 norm minimization results are better than the congruency robust method by seventy four percent in detecting points moved. on the other hand, the congruency robust method detects moved points better than the other method by eight percent. 2- in the networks whose displacements of points are about a few millimeters, l1 norm minimization detects moved points much better than the other method. some of the samples are available in the tables below. these two methods discover all points when the displacements of moved points are a few centimeters and both methods are reliable. thus, either l1 norm minimization or congruency robust method can be used in order to detect moved points. 3- the congruency robust method is not reliable when all points or all points except one or two are moved because it cannot find all moved points in this situation. on the contrary, all points are detected by the l1 norm minimization method. neither the norm minimization nor the congruency robust method could find moved points when we have all points moved. generally, if we have at least two unmoved points in the network, the results are reliable. in spit of this, deformation tensors should be applied. 4- the algorithm of norm minimization is simpler and its programming is easier than that of congruency robust method. in order to discover moved and unmoved points in the network, the study suggests that the norm minimization method should be applied. of course it is proposed that both methods be considered and the unmoved points obtained from them considered altogether as stable points. moved points that are erroneously detected as unmoved points are discovered by a statistical test applied after calculating the displacements of unmoved points. these points are considered as unmoved points.
منابع مشابه
L1-norm minimization for quaternion signals
—The l 1-norm minimization problem plays an important role in the compressed sensing (CS) theory. We present in this letter an algorithm for solving the problem of l 1 Index Terms—L-norm minimization for quaternion signals by converting it to second-order cone programming. An application example of the proposed algorithm is also given for practical guidelines of perfect recovery of quaternion s...
متن کاملGraph Cuts via l1 Norm Minimization
Graph cuts have become an increasingly important tool for solving a number of energy minimization problems in computer vision and other fields. In this paper, the graph cut problem is reformulated as an unconstrained l1 norm minimization that can be solved effectively using interior point methods. This reformulation exposes connections between the graph cuts and other related continuous optimiz...
متن کاملRobust Distance Metric Learning via Simultaneous L1-Norm Minimization and Maximization
Traditional distance metric learning with side information usually formulates the objectives using the covariance matrices of the data point pairs in the two constraint sets of must-links and cannotlinks. Because the covariance matrix computes the sum of the squared l2-norm distances, it is prone to both outlier samples and outlier features. To develop a robust distance metric learning method, ...
متن کاملRobust model reduction by L1-norm minimization and approximation via dictionaries: application to nonlinear hyperbolic problems
We propose a novel model reduction approach for the approximation of non linear hyperbolic equations in the scalar and the system cases. The approach relies on an offline computation of a dictionary of solutions together with an online L1norm minimization of the residual. It is shown why this is a natural framework for hyperbolic problems and tested on nonlinear problems such as Burgers’ equati...
متن کاملLinear Programming and l1-Norm Minimization Problems with Convolution Constraints
We illustrate some recent results on exact solutions to discrete-time l1-norm minimization problems with convolution constraints. A fixed-point property for this class of problems is introduced. The convolution constraints can be interpreted as a dynamic system with initial conditions. We show by construction that optimal solutions with a rational Z-transform exist for any initial conditions sa...
متن کاملRobust subspace computation using L1 norm
Linear subspace has many important applications in computer vision, such as structure from motion, motion estimation, layer extraction, object recognition, and object tracking. Singular Value Decomposition (SVD) algorithm is a standard technique to compute the subspace from the input data. The SVD algorithm, however, is sensitive to outliers as it uses L2 norm metric, and it can not handle miss...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
فیزیک زمین و فضاجلد ۳۴، شماره ۱، صفحات ۰-۰
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023